<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
    <title>max_cap_path</title>
  </head>
  <body bgcolor="#FFFFFF">
    <center>Scilab function</center>
    <div align="right">Last update : September 1995</div>
    <p>
      <b>max_cap_path</b> -  maximum capacity path</p>
    <h3>
      <font color="blue">Calling Sequence</font>
    </h3>
    <dl>
      <dd>
        <tt>[p,cap] = max_cap_path(i,j,g)  </tt>
      </dd>
    </dl>
    <h3>
      <font color="blue">Parameters</font>
    </h3>
    <ul>
      <li>
        <tt>
          <b>i,j</b>
        </tt>: integers, node numbers</li>
      <li>
        <tt>
          <b>g</b>
        </tt>: graph list</li>
      <li>
        <tt>
          <b>p</b>
        </tt>: row vector of integer numbers of the arcs of the path if it exists</li>
      <li>
        <tt>
          <b>cap</b>
        </tt>: value of the capacity of the path</li>
    </ul>
    <h3>
      <font color="blue">Description</font>
    </h3>
    <p>
      <tt>
        <b>max_cap_path</b>
      </tt> returns the path with maximum capacity from node
    <tt>
        <b>i</b>
      </tt> to node <tt>
        <b>j</b>
      </tt> for the graph <tt>
        <b>g</b>
      </tt> if it exists and returns 
    the empty vector <tt>
        <b>[]</b>
      </tt> otherwise.</p>
    <p>
    The capacities of the edges are given by the element <tt>
        <b>edge_max_cap</b>
      </tt>
    of the graph list. If its value is not given (empty vector <tt>
        <b>[]</b>
      </tt>), 
    <tt>
        <b>max_cap_path</b>
      </tt> returns the empty vector <tt>
        <b>[]</b>
      </tt>.
    The capacities must be strictly positive, i.e negative capacities
    are considered as equal to 0 (no capacity at all).</p>
    <h3>
      <font color="blue">Examples</font>
    </h3>
    <pre>

ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 15 12 13 9 10 14 11 16 1 17 14 15];
g=make_graph('foo',1,17,ta,he);
g('node_x')=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642];
g('node_y')=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301];
show_graph(g);
ma=edge_number(g);
g('edge_max_cap')=int(rand(1,ma)*16)+5;
[p,cap]=max_cap_path(1,14,g);
edgecolor=1*ones(1,ma); edgecolor(p)=11*ones(p); g('edge_color')=edgecolor;
x_message(['The maximum capacity is: '+string(cap);
           'Showing the corresponding path']);
show_graph(g); show_arcs(p);
 
  </pre>
  </body>
</html>
